
/* 阶乘阶（递归实现） */
int factorialRecur(int n) {
    if (n <= 1) return 1;
    int count = 0;
    for (int i = 0; i < n; ++i)
        count += factorialRecur(n - 1);
    return count;
}
